Errorless Robust JPEG Steganography using Outputs of JPEG Coders

Robust steganography is a technique of hiding secret messages in images so that the message can be recovered after additional image processing. One most popular processing operations JPEG recompression. Unfortunately, today's steganographic methods addressing this issue only provide probabilistic guarantee recovering and are consequently not errorless. That unacceptable since even single unexpected change make whole unreadable if it encrypted. We propose to create robust set DCT coefficients by inspecting their behavior during recompression, which requires access targeted compressor. This done dividing into 64 non-overlapping lattices because one embedding potentially affect many other from same block The robustness then combined with standard costs creating lattice scheme against Through experiments, we show size scheme's security depends on ordering embedding. verify validity proposed method three typical compressors Slack instant messaging application. benchmark its for various payloads, different ways lattices, range Quality Factors. Finally, errorless construction, meaning embedded will always readable.